Tau laws for pi calculus
نویسندگان
چکیده
منابع مشابه
Tau laws for pi calculus
The paper investigates the non-symbolic algebraic semantics of the weak bisimulation congruenceson finite pi processes. The weak bisimulation congruences are studied both in the absence and inthe presence of the mismatch operator. Some interesting phenomena about the open congruences arerevealed. Several new tau laws are discovered and their relationship is discussed. The contributi...
متن کاملPi-nets: interaction nets for pi-calculus
π-calculus is a framework that aims to describe concurrent calculations through a formal definition of processes. Originally, π-calculus is defined by a formal language and a set of reduction rules, much in the spirit of λ-calculus. Our aim is to provide a graphical representation of π-calculus using multi-wired interaction nets, in the spirit this time of proof-nets of linear logic. 1 π-calcul...
متن کاملStateful Applied Pi Calculus
We extend the applied pi calculus with state cells, which are used toreason about protocols that store persistent information. Examples are protocolsinvolving databases or hardware modules with internal state. We distinguish be-tween private state cells, which are not available to the attacker, and public statecells, which arise when a private state cell is compromised by the at...
متن کاملStochastic Pi-calculus Revisited
We develop a version of stochastic Pi-calculus endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space of processes and (ii) a well behaved SOS associates to each process, in a specified rate environment, a behaviour defined by a set of measures over the measurable spac...
متن کاملApplied pi calculus
The applied pi calculus is a language for modelling security protocols. It is an extension of the pi calculus, a language for studying concurrency and process interaction. This chapter presents the applied pi calculus in a tutorial style. It describes reachability, correspondence, and observational equivalence properties, with examples showing how to model secrecy, authentication, and privacy a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00202-0